Variable search query vertical access

ABSTRACT

In one embodiment, a method includes receiving a search query input comprising a character string having a first number of characters; searching one or more indexes of one or more verticals to identify terms corresponding to the search query input, wherein if the first number is less than or equal to a threshold number, then searching one or more first indexes, wherein each first index is related to objects of a first object-type, and if the first number is greater than the threshold number, then searching the one or more first indexes and one or more second indexes, wherein each second index is related to objects of a second object-type different than the first object-type; and sending instructions for presenting one or more suggested queries, each suggested query comprising the character string of the search query input and one or more of the identified terms.

PRIORITY

This application is a continuation under 35 U.S.C. § 120 of U.S. patentapplication Ser. No. 13/870,113, filed 25 Apr. 2013.

TECHNICAL FIELD

This disclosure generally relates to social graphs and performingsearches for objects within a social-networking environment.

BACKGROUND

A social-networking system, which may include a social-networkingwebsite, may enable its users (such as persons or organizations) tointeract with it and with each other through it. The social-networkingsystem may, with input from a user, create and store in thesocial-networking system a user profile associated with the user. Theuser profile may include demographic information, communication-channelinformation, and information on personal interests of the user. Thesocial-networking system may also, with input from a user, create andstore a record of relationships of the user with other users of thesocial-networking system, as well as provide services (e.g. wall posts,photo-sharing, event organization, messaging, games, or advertisements)to facilitate social interaction between or among users.

The social-networking system may send over one or more networks contentor messages related to its services to a mobile or other computingdevice of a user. A user may also install software applications on amobile or other computing device of the user for accessing a userprofile of the user and other data within the social-networking system.The social-networking system may generate a personalized set of contentobjects to display to a user, such as a newsfeed of aggregated storiesof other users connected to the user.

Social-graph analysis views social relationships in terms of networktheory consisting of nodes and edges. Nodes represent the individualactors within the networks, and edges represent the relationshipsbetween the actors. The resulting graph-based structures are often verycomplex. There can be many types of nodes and many types of edges forconnecting nodes. In its simplest form, a social graph is a map of allof the relevant edges between all the nodes being studied.

SUMMARY OF PARTICULAR EMBODIMENTS

In particular embodiments, a user of a social-networking system maysearch for objects associated with the system using a search queries.

In particular embodiments, in response to a search query input receivedfrom a user, the social-networking system may accessing one or moreverticals to search for objects that match the character string of thesearch query input. The number of verticals accessed in response to thesearch query input may vary based on the length of the character string.For shorter character strings, the character string may match a largenumber of objects. Consequently, processing a relatively short characterstring may be an inefficient. In order to improve the efficiency of thequery process, only a limited number of verticals may be searched formatches to shorter character strings. However, as the user inputsadditional characters, additional verticals may be searched. As thesearch query increases in length, fewer objects will match the query,and thus it may become more efficient to search a larger number ofverticals for matches to the longer character string. Based on theidentified objects, the social-networking system may then sendreferences to those objects for display to the user, for example in adrop-down menu associated with the query field. The querying user maythen select among the references to indicate that the objectcorresponding to the reference should be retrieved by thesocial-networking system. By accessing a variable number of verticals asdescribed herein, the efficiency of the query process may be improved bylimiting the number of verticals that are search in response torelatively short search queries that may match a large number ofobjects, and by expanding the number and type of verticals searches asthe query becomes more refined.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example network environment associated with asocial-networking system.

FIG. 2 illustrates an example social graph.

FIG. 3 illustrates an example partitioning for storing objects of asocial-networking system.

FIG. 4 illustrates an example webpage of an online social network.

FIGS. 5A-5B illustrate example queries of the social network.

FIG. 6 illustrates an example method for searching verticals in responseto a query.

FIG. 7 illustrates an example computer system.

DESCRIPTION OF EXAMPLE EMBODIMENTS

System Overview

FIG. 1 illustrates an example network environment 100 associated with asocial-networking system. Network environment 100 includes client system130, social-networking system 160, and third-party system 170 connectedto each other by a network 110. Although FIG. 1 illustrates a particulararrangement of client system 130, social-networking system 160,third-party system 170, and network 110, this disclosure contemplatesany suitable arrangement of client system 130, social-networking system160, third-party system 170, and network 110. As an example and not byway of limitation, two or more of client system 130, social-networkingsystem 160, and third-party system 170 may be connected to each otherdirectly, bypassing network 110. As another example, two or more ofclient system 130, social-networking system 160, and third-party system170 may be physically or logically co-located with each other in wholeor in part. Moreover, although FIG. 1 illustrates a particular number ofclient systems 130, social-networking systems 160, third-party systems170, and networks 110, this disclosure contemplates any suitable numberof client systems 130, social-networking systems 160, third-partysystems 170, and networks 110. As an example and not by way oflimitation, network environment 100 may include multiple client system130, social-networking systems 160, third-party systems 170, andnetworks 110.

This disclosure contemplates any suitable network 110. As an example andnot by way of limitation, one or more portions of network 110 mayinclude an ad hoc network, an intranet, an extranet, a virtual privatenetwork (VPN), a local area network (LAN), a wireless LAN (WLAN), a widearea network (WAN), a wireless WAN (WWAN), a metropolitan area network(MAN), a portion of the Internet, a portion of the Public SwitchedTelephone Network (PSTN), a cellular telephone network, or a combinationof two or more of these. Network 110 may include one or more networks110.

Links 150 may connect client system 130, social-networking system 160,and third-party system 170 to communication network 110 or to eachother. This disclosure contemplates any suitable links 150. Inparticular embodiments, one or more links 150 include one or morewireline (such as for example Digital Subscriber Line (DSL) or Data OverCable Service Interface Specification (DOCSIS)), wireless (such as forexample Wi-Fi or Worldwide Interoperability for Microwave Access(WiMAX)), or optical (such as for example Synchronous Optical Network(SONET) or Synchronous Digital Hierarchy (SDH)) links. In particularembodiments, one or more links 150 each include an ad hoc network, anintranet, an extranet, a VPN, a LAN, a WLAN, a WAN, a WWAN, a MAN, aportion of the Internet, a portion of the PSTN, a cellulartechnology-based network, a satellite communications technology-basednetwork, another link 150, or a combination of two or more such links150. Links 150 need not necessarily be the same throughout networkenvironment 100. One or more first links 150 may differ in one or morerespects from one or more second links 150.

In particular embodiments, client system 130 may be an electronic deviceincluding hardware, software, or embedded logic components or acombination of two or more such components and capable of carrying outthe appropriate functionalities implemented or supported by clientsystem 130. As an example and not by way of limitation, client system130 may include a computer system such as a desktop computer, notebookor laptop computer, netbook, a tablet computer, e-book reader, GPSdevice, camera, personal digital assistant (PDA), handheld electronicdevice, cellular telephone, smartphone, other suitable electronicdevice, or any suitable combination thereof. This disclosurecontemplates any suitable client systems 130. Client system 130 mayenable a network user at client system 130 to access network 110. Clientsystem 130 may enable its user to communicate with other users at otherclient systems 130.

In particular embodiments, client system 130 may include a web browser132, such as MICROSOFT INTERNET EXPLORER, GOOGLE CHROME or MOZILLAFIREFOX, and may have one or more add-ons, plug-ins, or otherextensions, such as TOOLBAR or YAHOO TOOLBAR. A user at client system130 may enter a Uniform Resource Locator (URL) or other addressdirecting the web browser 132 to a particular server (such as server162, or a server associated with third-party system 170), and the webbrowser 132 may generate a Hyper Text Transfer Protocol (HTTP) requestand communicate the HTTP request to server. The server may accept theHTTP request and communicate to client system 130 one or more Hyper TextMarkup Language (HTML) files responsive to the HTTP request. Clientsystem 130 may render a webpage based on the HTML files from the serverfor presentation to the user. This disclosure contemplates any suitablewebpage files. As an example and not by way of limitation, webpages mayrender from HTML files, Extensible Hyper Text Markup Language (XHTML)files, or Extensible Markup Language (XML) files, according toparticular needs. Such pages may also execute scripts such as, forexample and without limitation, those written in JAVASCRIPT, JAVA,MICROSOFT SILVERLIGHT, combinations of markup language and scripts suchas AJAX (Asynchronous JAVASCRIPT and XML), and the like. Herein,reference to a webpage encompasses one or more corresponding webpagefiles (which a browser may use to render the webpage) and vice versa,where appropriate.

In particular embodiments, social-networking system 160 may be anetwork-addressable computing system that can host an online socialnetwork. Social-networking system 160 may generate, store, receive, andsend social-networking data, such as, for example, user-profile data,concept-profile data, social-graph information, or other suitable datarelated to the online social network. Social-networking system 160 maybe accessed by the other components of network environment 100 eitherdirectly or via network 110. In particular embodiments,social-networking system 160 may include one or more servers 162. Eachserver 162 may be a unitary server or a distributed server spanningmultiple computers or multiple datacenters. Servers 162 may be ofvarious types, such as, for example and without limitation, web server,news server, mail server, message server, advertising server, fileserver, application server, exchange server, database server, proxyserver, another server suitable for performing functions or processesdescribed herein, or any combination thereof. In particular embodiments,each server 162 may include hardware, software, or embedded logiccomponents or a combination of two or more such components for carryingout the appropriate functionalities implemented or supported by server162. In particular embodiments, social-networking system 164 may includeone or more data stores 164. Data stores 164 may be used to storevarious types of information. In particular embodiments, the informationstored in data stores 164 may be organized according to specific datastructures. In particular embodiments, each data store 164 may be arelational, columnar, correlation, or other suitable database. Althoughthis disclosure describes or illustrates particular types of databases,this disclosure contemplates any suitable types of databases. Particularembodiments may provide interfaces that enable client system 130,social-networking system 160, or third-party system 170 to manage,retrieve, modify, add, or delete, the information stored in data store164.

In particular embodiments, social-networking system 160 may store one ormore social graphs in one or more data stores 164. In particularembodiments, a social graph may include multiple nodes—which may includemultiple user nodes (each corresponding to a particular user) ormultiple concept nodes (each corresponding to a particular concept)—andmultiple edges connecting the nodes. Social-networking system 160 mayprovide users of the online social network the ability to communicateand interact with other users. In particular embodiments, users may jointhe online social network via social-networking system 160 and then addconnections (i.e., relationships) to a number of other users ofsocial-networking system 160 whom they want to be connected to. Herein,the term “friend” may refer to any other user of social-networkingsystem 160 with whom a user has formed a connection, association, orrelationship via social-networking system 160.

In particular embodiments, social-networking system 160 may provideusers with the ability to take actions on various types of items orobjects, supported by social-networking system 160. As an example andnot by way of limitation, the items and objects may include groups orsocial networks to which users of social-networking system 160 maybelong, events or calendar entries in which a user might be interested,computer-based applications that a user may use, transactions that allowusers to buy or sell items via the service, interactions withadvertisements that a user may perform, or other suitable items orobjects. A user may interact with anything that is capable of beingrepresented in social-networking system 160 or by an external system ofthird-party system 170, which is separate from social-networking system160 and coupled to social-networking system 160 via a network 110.

In particular embodiments, social-networking system 160 may be capableof linking a variety of entities. As an example and not by way oflimitation, social-networking system 160 may enable users to interactwith each other as well as receive content from third-party systems 170or other entities, or to allow users to interact with these entitiesthrough an application programming interfaces (API) or othercommunication channels.

In particular embodiments, third-party system 170 may include one ormore types of servers, one or more data stores, one or more interfaces,including but not limited to APIs, one or more web services, one or morecontent sources, one or more networks, or any other suitable components,e.g., that servers may communicate with. A third-party system 170 may beoperated by a different entity from an entity operatingsocial-networking system 160. In particular embodiments, however,social-networking system 160 and third-party systems 170 may operate inconjunction with each other to provide social-networking services tousers of social-networking system 160 or third-party systems 170. Inthis sense, social-networking system 160 may provide a platform, orbackbone, which other systems, such as third-party systems 170, may useto provide social-networking services and functionality to users acrossthe Internet.

In particular embodiments, third-party system 170 may include athird-party content object provider. A third-party content objectprovider may include one or more sources of content objects, which maybe communicated to client system 130. As an example and not by way oflimitation, content objects may include information regarding things oractivities of interest to the user, such as, for example, movie showtimes, movie reviews, restaurant reviews, restaurant menus, productinformation and reviews, or other suitable information. As anotherexample and not by way of limitation, content objects may includeincentive content objects, such as coupons, discount tickets, giftcertificates, or other suitable incentive objects.

In particular embodiments, social-networking system 160 also includesuser-generated content objects, which may enhance a user's interactionswith social-networking system 160. User-generated content may includeanything a user can add, upload, send, or “post” to social-networkingsystem 160. As an example and not by way of limitation, a usercommunicates posts to social-networking system 160 from client system130. Posts may include data such as status updates or other textualdata, location information, photos, videos, links, music or othersimilar data or media. Content may also be added to social-networkingsystem 160 by a third-party through a “communication channel,” such as anewsfeed or stream.

In particular embodiments, social-networking system 160 may include avariety of servers, sub-systems, programs, modules, logs, and datastores. In particular embodiments, social-networking system 160 mayinclude one or more of the following: a web server, action logger,API-request server, relevance-and-ranking engine, content-objectclassifier, notification controller, action log,third-party-content-object-exposure log, inference module,authorization/privacy server, search module, ad-targeting module,user-interface module, user-profile store, connection store, third-partycontent store, or location store. Social-networking system 160 may alsoinclude suitable components such as network interfaces, securitymechanisms, load balancers, failover servers,management-and-network-operations consoles, other suitable components,or any suitable combination thereof. In particular embodiments,social-networking system 160 may include one or more user-profile storesfor storing user profiles. A user profile may include, for example,biographic information, demographic information, behavioral information,social information, or other types of descriptive information, such aswork experience, educational history, hobbies or preferences, interests,affinities, or location. Interest information may include interestsrelated to one or more categories. Categories may be general orspecific. As an example and not by way of limitation, if a user “likes”an article about a brand of shoes the category may be the brand, or thegeneral category of “shoes” or “clothing.” A connection store may beused for storing connection information about users. The connectioninformation may indicate users who have similar or common workexperience, group memberships, hobbies, educational history, or are inany way related or share common attributes. The connection informationmay also include user-defined connections between different users andcontent objects (both internal and external). A web server may be usedfor linking social-networking system 160 to one or more client systems130 or one or more third-party system 170 via network 110. The webserver may include a mail server or other messaging functionality forreceiving and routing messages between social-networking system 160 andone or more client systems 130. An API-request server may allowthird-party system 170 to access information from social-networkingsystem 160 by calling one or more APIs. An action logger may be used toreceive communications from a web server about a user's actions on oroff social-networking system 160. In conjunction with the action log, athird-party-content-object log may be maintained of user exposures tothird-party-content objects. A notification controller may provideinformation regarding content objects to client system 130. Informationmay be pushed to client system 130 as notifications, or information maybe pulled from client system 130 responsive to a request received fromclient system 130. Authorization servers may be used to enforce one ormore privacy settings of the users of social-networking system 160. Aprivacy setting of a user determines how particular informationassociated with a user can be shared. The authorization server may allowusers to opt in or opt out of having their actions logged bysocial-networking system 160 or shared with other systems (e.g.,third-party system 170), such as, for example, by setting appropriateprivacy settings. Third-party-content-object stores may be used to storecontent objects received from third parties, such as third-party system170. Location stores may be used for storing location informationreceived from client systems 130 associated with users.Advertisement-pricing modules may combine social information, thecurrent time, location information, or other suitable information toprovide relevant advertisements, in the form of notifications, to auser.

Social Graphs

FIG. 2 illustrates example social graph 200. In particular embodiments,social-networking system 160 may store one or more social graphs 200 inone or more data stores. In particular embodiments, social graph 200 mayinclude multiple nodes—which may include multiple user nodes 202 ormultiple concept nodes 204—and multiple edges 206 connecting the nodes.Example social graph 200 illustrated in FIG. 2 is shown, for didacticpurposes, in a two-dimensional visual map representation. In particularembodiments, social-networking system 160, client system 130, orthird-party system 170 may access social graph 200 and relatedsocial-graph information for suitable applications. The nodes and edgesof social graph 200 may be stored as data objects, for example, in adata store (such as a social-graph database). Such a data store mayinclude one or more searchable or queryable indexes of nodes or edges ofsocial graph 200.

In particular embodiments, a user node 202 may correspond to a user ofsocial-networking system 160. As an example and not by way oflimitation, a user may be an individual (human user), an entity (e.g.,an enterprise, business, or third-party application), or a group (e.g.,of individuals or entities) that interacts or communicates with or oversocial-networking system 160. In particular embodiments, when a userregisters for an account with social-networking system 160,social-networking system 160 may create a user node 202 corresponding tothe user, and store the user node 202 in one or more data stores. Usersand user nodes 202 described herein may, where appropriate, refer toregistered users and user nodes 202 associated with registered users. Inaddition or as an alternative, users and user nodes 202 described hereinmay, where appropriate, refer to users that have not registered withsocial-networking system 160. In particular embodiments, a user node 202may be associated with information provided by a user or informationgathered by various systems, including social-networking system 160. Asan example and not by way of limitation, a user may provide his or hername, profile picture, contact information, birth date, sex, maritalstatus, family status, employment, education background, preferences,interests, or other demographic information. In particular embodiments,a user node 202 may be associated with one or more data objectscorresponding to information associated with a user. In particularembodiments, a user node 202 may correspond to one or more webpages.

In particular embodiments, a concept node 204 may correspond to aconcept. As an example and not by way of limitation, a concept maycorrespond to a place (such as, for example, a movie theater,restaurant, landmark, or city); a website (such as, for example, awebsite associated with social-network system 160 or a third-partywebsite associated with a web-application server); an entity (such as,for example, a person, business, group, sports team, or celebrity); aresource (such as, for example, an audio file, video file, digitalphoto, text file, structured document, or application) which may belocated within social-networking system 160 or on an external server,such as a web-application server; real or intellectual property (suchas, for example, a sculpture, painting, movie, game, song, idea,photograph, or written work); a game; an activity; an idea or theory;another suitable concept; or two or more such concepts. A concept node204 may be associated with information of a concept provided by a useror information gathered by various systems, including social-networkingsystem 160. As an example and not by way of limitation, information of aconcept may include a name or a title; one or more images (e.g., animage of the cover page of a book); a location (e.g., an address or ageographical location); a website (which may be associated with a URL);contact information (e.g., a phone number or an email address); othersuitable concept information; or any suitable combination of suchinformation. In particular embodiments, a concept node 204 may beassociated with one or more data objects corresponding to informationassociated with concept node 204. In particular embodiments, a conceptnode 204 may correspond to one or more webpages.

In particular embodiments, a node in social graph 200 may represent orbe represented by a webpage (which may be referred to as a “profilepage”). Profile pages may be hosted by or accessible tosocial-networking system 160. Profile pages may also be hosted onthird-party websites associated with a third-party server 170. As anexample and not by way of limitation, a profile page corresponding to aparticular external webpage may be the particular external webpage andthe profile page may correspond to a particular concept node 204.Profile pages may be viewable by all or a selected subset of otherusers. As an example and not by way of limitation, a user node 202 mayhave a corresponding user-profile page in which the corresponding usermay add content, make declarations, or otherwise express himself orherself. As another example and not by way of limitation, a concept node204 may have a corresponding concept-profile page in which one or moreusers may add content, make declarations, or express themselves,particularly in relation to the concept corresponding to concept node204.

In particular embodiments, a concept node 204 may represent athird-party webpage or resource hosted by third-party system 170. Thethird-party webpage or resource may include, among other elements,content, a selectable or other icon, or other inter-actable object(which may be implemented, for example, in JavaScript, AJAX, or PHPcodes) representing an action or activity. As an example and not by wayof limitation, a third-party webpage may include a selectable icon suchas “like,” “check in,” “eat,” “recommend,” or another suitable action oractivity. A user viewing the third-party webpage may perform an actionby selecting one of the icons (e.g., “eat”), causing client system 130to send to social-networking system 160 a message indicating the user'saction. In response to the message, social-networking system 160 maycreate an edge (e.g., an “eat” edge) between a user node 202corresponding to the user and a concept node 204 corresponding to thethird-party webpage or resource and store edge 206 in one or more datastores.

In particular embodiments, a pair of nodes in social graph 200 may beconnected to each other by one or more edges 206. An edge 206 connectinga pair of nodes may represent a relationship between the pair of nodes.In particular embodiments, an edge 206 may include or represent one ormore data objects or attributes corresponding to the relationshipbetween a pair of nodes. As an example and not by way of limitation, afirst user may indicate that a second user is a “friend” of the firstuser. In response to this indication, social-networking system 160 maysend a “friend request” to the second user. If the second user confirmsthe “friend request,” social-networking system 160 may create an edge206 connecting the first user's user node 202 to the second user's usernode 202 in social graph 200 and store edge 206 as social-graphinformation in one or more of data stores 24. In the example of FIG. 2,social graph 200 includes an edge 206 indicating a friend relationbetween user nodes 202 of user “A” and user “B” and an edge indicating afriend relation between user nodes 202 of user “C” and user “B.”Although this disclosure describes or illustrates particular edges 206with particular attributes connecting particular user nodes 202, thisdisclosure contemplates any suitable edges 206 with any suitableattributes connecting user nodes 202. As an example and not by way oflimitation, an edge 206 may represent a friendship, family relationship,business or employment relationship, fan relationship, followerrelationship, visitor relationship, subscriber relationship,superior/subordinate relationship, reciprocal relationship,non-reciprocal relationship, another suitable type of relationship, ortwo or more such relationships. Moreover, although this disclosuregenerally describes nodes as being connected, this disclosure alsodescribes users or concepts as being connected. Herein, references tousers or concepts being connected may, where appropriate, refer to thenodes corresponding to those users or concepts being connected in socialgraph 200 by one or more edges 206.

In particular embodiments, an edge 206 between a user node 202 and aconcept node 204 may represent a particular action or activity performedby a user associated with user node 202 toward a concept associated witha concept node 204. As an example and not by way of limitation, asillustrated in FIG. 2, a user may “like,” “attended,” “played,”“listened,” “cooked,” “worked at,” or “watched” a concept, each of whichmay correspond to a edge type or subtype. A concept-profile pagecorresponding to a concept node 204 may include, for example, aselectable “check in” icon (such as, for example, a clickable “check in”icon) or a selectable “add to favorites” icon. Similarly, after a userclicks these icons, social-networking system 160 may create a “favorite”edge or a “check in” edge in response to a user's action correspondingto a respective action. As another example and not by way of limitation,a user (user “C”) may listen to a particular song (“Imagine”) using aparticular application (SPOTIFY, which is an online music application).In this case, social-networking system 160 may create a “listened” edge206 and a “used” edge (as illustrated in FIG. 2) between user nodes 202corresponding to the user and concept nodes 204 corresponding to thesong and application to indicate that the user listened to the song andused the application. Moreover, social-networking system 160 may createa “played” edge 206 (as illustrated in FIG. 2) between concept nodes 204corresponding to the song and the application to indicate that theparticular song was played by the particular application. In this case,“played” edge 206 corresponds to an action performed by an externalapplication (SPOTIFY) on an external audio file (the song “Imagine”).Although this disclosure describes particular edges 206 with particularattributes connecting user nodes 202 and concept nodes 204, thisdisclosure contemplates any suitable edges 206 with any suitableattributes connecting user nodes 202 and concept nodes 204. Moreover,although this disclosure describes edges between a user node 202 and aconcept node 204 representing a single relationship, this disclosurecontemplates edges between a user node 202 and a concept node 204representing one or more relationships. As an example and not by way oflimitation, an edge 206 may represent both that a user likes and hasused at a particular concept. Alternatively, another edge 206 mayrepresent each type of relationship (or multiples of a singlerelationship) between a user node 202 and a concept node 204 (asillustrated in FIG. 2 between user node 202 for user “E” and conceptnode 204 for “SPOTIFY”).

In particular embodiments, social-networking system 160 may create anedge 206 between a user node 202 and a concept node 204 in social graph200. As an example and not by way of limitation, a user viewing aconcept-profile page (such as, for example, by using a web browser or aspecial-purpose application hosted by the user's client system 130) mayindicate that he or she likes the concept represented by the conceptnode 204 by clicking or selecting a “Like” icon, which may cause theuser's client system 130 to send to social-networking system 160 amessage indicating the user's liking of the concept associated with theconcept-profile page. In response to the message, social-networkingsystem 160 may create an edge 206 between user node 202 associated withthe user and concept node 204, as illustrated by “like” edge 206 betweenthe user and concept node 204. In particular embodiments,social-networking system 160 may store an edge 206 in one or more datastores. In particular embodiments, an edge 206 may be automaticallyformed by social-networking system 160 in response to a particular useraction. As an example and not by way of limitation, if a first useruploads a picture, watches a movie, or listens to a song, an edge 206may be formed between user node 202 corresponding to the first user andconcept nodes 204 corresponding to those concepts. Although thisdisclosure describes forming particular edges 206 in particular manners,this disclosure contemplates forming any suitable edges 206 in anysuitable manner.

Indexing Based on Object-type

FIG. 3 illustrates an example partitioning for storing objects ofsocial-networking system 160. A plurality of data stores 164 (which mayalso be called “verticals”) may store objects of social-networkingsystem 160. The amount of data (e.g., data for a social graph 200)stored in the data stores may be very large. As an example and not byway of limitation, a social graph used by Facebook, Inc. of Menlo Park,Calif. can have a number of nodes in the order of 10⁸, and a number ofedges in the order of 10¹⁰. Typically, a large collection of data suchas a large database may be divided into a number of partitions. As theindex for each partition of a database is smaller than the index for theoverall database, the partitioning may improve performance in accessingthe database. As the partitions may be distributed over a large numberof servers, the partitioning may also improve performance andreliability in accessing the database. Ordinarily, a database may bepartitioned by storing rows (or columns) of the database separately. Inparticular embodiments, a database maybe partitioned by based onobject-types. Data objects may be stored in a plurality of partitions,each partition holding data objects of a single object-type. Inparticular embodiments, social-networking system 160 may retrieve searchresults in response to a search query by submitting the search query toa particular partition storing objects of the same object-type as thesearch query's expected results. Although this disclosure describesstoring objects in a particular manner, this disclosure contemplatesstoring objects in any suitable manner.

In particular embodiments, each object may correspond to a particularnode of a social graph 200. An edge 206 connecting the particular nodeand another node may indicate a relationship between objectscorresponding to these nodes. In addition to storing objects, aparticular data store may also store social-graph information relatingto the object. Alternatively, social-graph information about particularobjects may be stored in a different data store from the objects.Social-networking system 160 may update the search index of the datastore based on newly received objects, and relationships associated withthe received objects.

In particular embodiments, each data store 164 may be configured tostore objects of a particular one of a plurality of object-types inrespective data storage devices 340. An object-type may be, for example,a user, a photo, a post, a comment, a message, an event listing, awebpage, an application, a location, a user-profile page, aconcept-profile page, a user group, an audio file, a video, anoffer/coupon, or another suitable type of object. Although thisdisclosure describes particular types of objects, this disclosurecontemplates any suitable types of objects. As an example and not by wayof limitation, a user vertical P1 illustrated in FIG. 3 may store userobjects. Each user object stored in the user vertical P1 may comprise anidentifier (e.g., a character string), a user name, and a profilepicture for a user of the online social network. Social-networkingsystem 160 may also store in the user vertical P1 information associatedwith a user object such as language, location, education, contactinformation, interests, relationship status, a list of friends/contacts,a list of family members, privacy settings, and so on. As an example andnot by way of limitation, a post vertical P2 illustrated in FIG. 3 maystore post objects. Each post object stored in the post vertical P2 maycomprise an identifier, a text string for a post posted tosocial-networking system 160. Social-networking system 160 may alsostore in the post vertical P2 information associated with a post objectsuch as a time stamp, an author, privacy settings, users who like thepost, a count of likes, comments, a count of comments, location, and soon. As an example and not by way of limitation, a photo vertical P3 maystore photo objects (or objects of other media types such as video oraudio). Each photo object stored in the photo vertical P3 may comprisean identifier and a photo. Social-networking system 160 may also storein the photo vertical P3 information associated with a photo object suchas a time stamp, an author, privacy settings, users who are tagged inthe photo, users who like the photo, comments, and so on. In particularembodiments, each data store may also be configured to store informationassociated with each stored object in data storage devices 340.

In particular embodiments, objects stored in each vertical 164 may beindexed by one or more search indices. The search indices may be hostedby respective index server 330 comprising one or more computing devices(e.g., servers). The index server 330 may update the search indicesbased on data (e.g., a photo and information associated with a photo)submitted to social-networking system 160 by users or other processes ofsocial-networking system 160 (or a third-party system). The index server330 may also update the search indices periodically (e.g., every 24hours). The index server 330 may receive a query comprising a searchterm, and access and retrieve search results from one or more searchindices corresponding to the search term. In some embodiments, avertical corresponding to a particular object-type may comprise aplurality of physical or logical partitions, each comprising respectivesearch indices.

In particular embodiments, social-networking system 160 may receive asearch query from a PHP (Hypertext Preprocessor) process 310. The PHPprocess 310 may comprise one or more computing processes hosted by oneor more servers 162 of social-networking system 160. The search querymay be a text string or a search query submitted to the PHP process by auser or another process of social-networking system 160 (or third-partysystem 170).

More information on indexes and search queries may be found in U.S.patent application Ser. No. 13/560,212, filed 27 Jul. 2012, U.S. patentapplication Ser. No. 13/560,901, filed 27 Jul. 2012, and U.S. patentapplication Ser. No. 13/723,861, filed 21 Dec. 2012, each of which isincorporated by reference.

Typeahead Processes

In particular embodiments, one or more client-side and/or backend(server-side) processes may implement and utilize a “typeahead” featurethat may automatically attempt to match social-graph elements (e.g.,user nodes 202, concept nodes 204, or edges 206) to informationcurrently being entered by a user in an input form rendered inconjunction with a requested webpage (such as, for example, auser-profile page, a concept-profile page, a search-results webpage, oranother suitable page of the online social network), which may be hostedby or accessible in social-networking system 160. In particularembodiments, as a user is entering text to make a declaration, thetypeahead feature may attempt to match the string of textual charactersbeing entered in the declaration to strings of characters (e.g., names,descriptions) corresponding to user, concepts, or edges and theircorresponding elements in the social graph 200. In particularembodiments, when a match is found, the typeahead feature mayautomatically populate the form with a reference to the social-graphelement (such as, for example, the node name/type, node ID, edgename/type, edge ID, or another suitable reference or identifier) of theexisting social-graph element.

In particular embodiments, as a user types or otherwise enters text intoa form used to add content or make declarations in various sections ofthe user's profile page, home page, or other page, the typeahead processmay work in conjunction with one or more frontend (client-side) and/orbackend (server-side) typeahead processes (hereinafter referred tosimply as “typeahead process”) executing at (or within)social-networking system 160 (e.g., within servers 162), tointeractively and virtually instantaneously (as appearing to the user)attempt to auto-populate the form with a term or terms corresponding tonames of existing social-graph elements, or terms associated withexisting social-graph elements, determined to be the most relevant orbest match to the characters of text entered by the user as the userenters the characters of text. Utilizing the social-graph information ina social-graph database or information extracted and indexed from thesocial-graph database, including information associated with nodes andedges, the typeahead processes, in conjunction with the information fromthe social-graph database, as well as potentially in conjunction withvarious others processes, applications, or databases located within orexecuting within social-networking system 160, may be able to predict auser's intended declaration with a high degree of precision. However,social-networking system 160 can also provides user's with the freedomto enter essentially any declaration they wish, enabling users toexpress themselves freely.

In particular embodiments, as a user enters text characters into a formbox or other field, the typeahead processes may attempt to identifyexisting social-graph elements (e.g., user nodes 202, concept nodes 204,or edges 206) that match the string of characters entered in the user'sdeclaration as the user is entering the characters. In particularembodiments, as the user enters characters into a form box, thetypeahead process may read the string of entered textual characters. Aseach keystroke is made, the frontend-typeahead process may send theentered character string as a request (or call) to the backend-typeaheadprocess executing within social-networking system 160. In particularembodiments, the typeahead processes may communicate via AJAX(Asynchronous JavaScript and XML) or other suitable techniques, andparticularly, asynchronous techniques. In particular embodiments, therequest may be, or comprise, an XMLHTTPRequest (XHR) enabling quick anddynamic sending and fetching of results. In particular embodiments, thetypeahead process may also send before, after, or with the request asection identifier (section ID) that identifies the particular sectionof the particular page in which the user is making the declaration. Inparticular embodiments, a user ID parameter may also be sent, but thismay be unnecessary in some embodiments, as the user may already be“known” based on the user having logged into (or otherwise beenauthenticated by) social-networking system 160.

In particular embodiments, the typeahead process may use one or morematching algorithms to attempt to identify matching social-graphelements. In particular embodiments, when a match or matches are found,the typeahead process may send a response (which may utilize AJAX orother suitable techniques) to the user's client system 130 that mayinclude, for example, the names (name strings) or descriptions of thematching social-graph elements as well as, potentially, other metadataassociated with the matching social-graph elements. As an example andnot by way of limitation, if a user entering the characters “pok” into aquery field, the typeahead process may display a drop-down menu thatdisplays names of matching existing profile pages and respective usernodes 202 or concept nodes 204, such as a profile page named or devotedto “poker” or “pokemon”, which the user can then click on or otherwiseselect thereby confirming the desire to declare the matched user orconcept name corresponding to the selected node. As another example andnot by way of limitation, upon clicking “poker,” the typeahead processmay auto-populate, or causes the web browser 132 to auto-populate, thequery field with the declaration “poker”. In particular embodiments, thetypeahead process may simply auto-populate the field with the name orother identifier of the top-ranked match rather than display a drop-downmenu. The user may then confirm the auto-populated declaration simply bykeying “enter” on his or her keyboard or by clicking on theauto-populated declaration.

More information on typeahead processes may be found in U.S. patentapplication Ser. No. 12/763,162, filed 19 Apr. 2010, and U.S. patentapplication Ser. No. 13/556,072, filed 23 Jul. 2012, each of which isincorporated by reference.

Variable Indexing with Typeahead Search Queries

FIG. 4 illustrates an example webpage of an online social network. Inparticular embodiments, a user may submit a query to the social-networksystem 160 by inputting text into query field 450. A user of an onlinesocial network may search for particular content objects (hereinafter“objects”) or content-object-types (hereinafter “object-types”)associated with the online social network (e.g., users, concepts,webpages, external content or resources) by providing a short phrasedescribing the object or object-type, often referred to as a “searchquery,” to a search engine. The query may be a text query and maycomprise one or more character strings (which may include one or moren-grams). In general, a user may input any character string comprisingone or more characters into query field 450 to search for objects onsocial-networking system 160 that substantially matches the characterstring. Social-networking system 160 may then search one or moreverticals 164 to identify objects matching the query. The search enginemay conduct a search based on the query using various search algorithmsand generate search results that identify objects (e.g., user-profilepages, content-profile pages, or external resources) that are mostlikely to be related to the search query. To conduct a search, a usermay input or send a search query to the search engine. In response, thesearch engine may identify one or more resources that are likely to berelated to the search query, each of which may individually be referredto as a “search result,” or collectively be referred to as the “searchresults” corresponding to the search query. The identified objects mayinclude, for example, social-graph elements (i.e., user nodes 202,concept nodes 204, edges 206), profile pages, external webpages, or anycombination thereof. Social-networking system 160 may then generate asearch-results webpage with search results corresponding to theidentified objects and send the search-results webpage to the user. Inparticular embodiments, the search engine may limit its search toobjects associated with the online social network. However, inparticular embodiments, the search engine may also search for objectsassociated with other sources, such as third-party system 170, theinternet or World Wide Web, or other suitable sources. Although thisdisclosure describes querying social-networking system 160 in aparticular manner, this disclosure contemplates queryingsocial-networking system 160 in any suitable manner.

In particular embodiments, the typeahead processes described herein maybe applied to search queries entered by a user. As an example and not byway of limitation, as a user enters text characters into a query filed450, a typeahead process may attempt to identify one or more user nodes202, concept nodes 204, or edges 206 that match the string of charactersentered into the query filed 450 as the user is entering the characters.As the typeahead process receives requests or calls including a stringor n-gram from the text query, the typeahead process may perform orcauses to be performed a search to identify existing social-graphelements (i.e., user nodes 202, concept nodes 204, edges 206) havingrespective names, types, categories, or other identifiers matching theentered text. The typeahead process may use one or more matchingalgorithms to attempt to identify matching nodes or edges. When a matchor matches are found, the typeahead process may send a response to theuser's client system 130 that may include, for example, the names (namestrings) of the matching nodes as well as, potentially, other metadataassociated with the matching nodes. The typeahead process may thendisplay a drop-down menu 400 that displays references to the matchingprofile pages (e.g., a name or photo associated with the page) of therespective user nodes 202 or concept nodes 204, and displays names ofmatching edges 206 that may connect to the matching user nodes 202 orconcept nodes 204, which the user can then click on or otherwise select,thereby confirming the desire to search for the matched user or conceptname corresponding to the selected node, or to search for users orconcepts connected to the matched users or concepts by the matchingedges. Alternatively, the typeahead process may simply auto-populate theform with the name or other identifier of the top-ranked match ratherthan display a drop-down menu 400. The user may then confirm theauto-populated declaration simply by keying “enter” on a keyboard or byclicking on the auto-populated declaration. Upon user confirmation ofthe matching nodes and/or edges, the typeahead process may send arequest that informs social-networking system 160 of the user'sconfirmation of a query containing the matching social-graph elements.In response to the sent request, social-networking system 160 mayautomatically (or alternately based on an instruction in the request)call or otherwise search a social-graph database for the matchingsocial-graph elements, or for social-graph elements connected to thematching social-graph elements as appropriate. Although this disclosuredescribes applying the typeahead processes to search queries in aparticular manner, this disclosure contemplates applying the typeaheadprocesses to search queries in any suitable manner.

In connection with search queries and search results, particularembodiments may utilize one or more systems, components, elements,functions, methods, operations, or steps disclosed in U.S. patentapplication Ser. No. 11/503,093, filed 11 Aug. 2006, U.S. patentapplication Ser. No. 12/977,027, filed 22 Dec. 2010, U.S. patentapplication Ser. No. 12/978,265, filed 23 Dec. 2010, and U.S. patentapplication Ser. No. 13/732,101, filed 31 Dec. 2012, each of which isincorporated by reference.

FIGS. 5A-5B illustrate example queries of the online social network. Inparticular embodiments, in response to a search query input receivedfrom a first user (i.e., the querying user), social-networking system160 may accessing one or more verticals 164 to search for objects thatmatch the search query input. The search query input may comprise acharacter string of one or more characters inputted by the queryinguser, for example, into a query field 450. The number of verticals 164accessed in response to the search query input may vary based on thelength of the character string (i.e., the search query length). For avery short character strings (e.g., a few characters), the characterstring may match a large number of objects. Consequently, processing avery short character string may be an intensive process. In order toimprove the efficiency of the query process, only a limited number ofverticals 164 (or even a subset of particular verticals 164) may besearched for matches to the short character strings. However, as thequerying user inputs additional characters, additional verticals 164 maybe searched. As the character string of the search query input increasesin length, fewer objects will match the character string, and thus itmay become more efficient to search a larger number of verticals 164 formatches to the longer character string. As the character string getslonger and the query gets more complex, more verticals 164 may besearched. As an example and not by way of limitation, if only twocharacters have been entered, as illustrated in FIG. 5A, only the usersvertical 164 may be searched to identify users that match the charactersentered. As more characters are added to the character string,additional verticals 164 (e.g., photos verticals 164, posts verticals164, pages verticals 164, etc.) may be searched. As an example and notby way of limitation, once the querying user inputs four characters, asillustrated in FIG. 5B, the pages vertical 164 may also be searched toidentified concepts that match the characters entered. Based on theidentified objects, social-networking system 160 may then sendreferences to one or more of the identified objects to the user fordisplay, for example, in a drop-down menu 400 associated with the queryfield 450. In conjunction with the typeahead processed describedpreviously, the references may be displayed to the user as the userinputs characters into the query field 450 as typeahead suggestions(via, for example, a client-side typeahead process). The querying usermay then select among the typeahead suggestions to indicate that theobject referenced in the suggestion should be retrieved bysocial-networking system 160. In other words, as the querying userenters more characters into the query field 450, the diversity ofresults displayed as typeahead suggestions in the drop-down menu 400will increase as additional verticals 164 are searched. FIGS. 5A-5Billustrate various example search query inputs in query field 450 andvarious references to identified objects matching the search query inputgenerated in response in drop-down menus 400 (although other suitablegraphical user interfaces are possible). By accessing a variable numberof verticals as described herein, the efficiency of the query processmay be improved by limiting the number of verticals that are search inresponse to relatively short search queries that may match a largenumber of objects, and by expanding the number and type of verticalssearches as the query becomes more refined. Although this disclosuredescribes and FIGS. 5A-5B illustrate searching verticals 164 in aparticular manner, this disclosure contemplates searching verticals 164in any suitable manner.

In particular embodiments, social-networking system 160 may receive froma querying/first user (corresponding to a first user node 202) a searchquery input. The search query input may be received in any suitablemanner, such as, for example, by having the user input the characterstring into a query field 450 on a webpage of the online social network.The search query input may comprise a character string having a firstnumber of characters. As an example and not by way of limitation, a usermay want to search for a user named “Catie Kaiser”, who is a2^(nd)-degree connection of the querying user. The querying user maybegin by entering characters from the user's surname, “ka”, asillustrated in FIG. 5A. In response, social-networking system 160 maysearch a users vertical 164 to identify one or more user nodes 202(corresponding to user-profile pages) that match the character string“ka”. However, for a character string of only two characters,social-networking system 160 may only search among users that are1^(st)-degree connections of the querying user, and thus the desired2^(nd)-degree connection “Catie Kaiser” may not be identified byentering only two characters. This may effectively force the queryinguser to input additional characters and refine the query in order toexpand the scope of the search query. Thus, the querying user may enteradditional character so that the search query input comprises acharacter string “kais”, as illustrated in FIG. 5B. As the querying userenters each character into query field 450, social-networking system 160may provide various typeahead suggestions that reference social-graphentities identified as matching the character string, as illustrated indrop-down menus 400. For the longer character string “kais”,social-networking system 160 may expand its search to include2^(nd)-degree connections and pages, and thus the user “Catie Kaiser”may be identified as a matching object. FIG. 5B illustrates a drop-downmenu 400 where a reference to the user “Catie Kaiser” is displayed inresponse to the query “kais”. Although this disclosure describesreceiving particular queries in a particular manner, this disclosurecontemplates receiving any suitable queries in any suitable manner.

In particular embodiments, social-networking system 160 may parse thesearch query received from the first user (i.e., the querying user) toidentify one or more n-grams. In general, an n-gram is a contiguoussequence of n items from a given sequence of text or speech. The itemsmay be characters, phonemes, syllables, letters, words, base pairs,prefixes, or other identifiable items from the sequence of text orspeech. The n-gram may comprise one or more characters of text (letters,numbers, punctuation, etc.) entered by the querying user. An n-gram ofsize one can be referred to as a “unigram,” of size two can be referredto as a “bigram” or “digram,” of size three can be referred to as a“trigram,” and so on. Each n-gram may include one or more parts from thesearch query received from the querying user. In particular embodiments,each n-gram may comprise a character string (e.g., one or morecharacters of text) entered by the first user. As an example and not byway of limitation, social-networking system 160 may parse the searchquery “all about recipes” to identify the following n-grams: all; about;recipes; all about; about recipes; all about recipes. In particularembodiments, each n-gram may comprise a contiguous sequence of n itemsfrom the search query. Although this disclosure describes parsingparticular queries in a particular manner, this disclosure contemplatesparsing any suitable queries in any suitable manner. In connection withelement detection and parsing search queries, particular embodiments mayutilize one or more systems, components, elements, functions, methods,operations, or steps disclosed in U.S. patent application Ser. No.13/556,072, filed 23 Jul. 2012, U.S. patent application Ser. No.13/732,101, filed 31 Dec. 2012, each of which is incorporated byreference.

In particular embodiments, social-networking system 160 may access oneor more verticals 164 in response to a search query received from auser. Each vertical 164 may store one or more objects associated withthe online social network. The number of verticals 164 accessed inresponse to the search query may be based on the length of the searchquery. As the search query length (i.e., the number of characters in thecharacter string comprising the search query input) increases,additional verticals 164 may be accessed. Each additional set ofverticals 164 accessed may be of a different object-type, such that asmore characters are added to the character string, more object-types maybe searched. In particular embodiments, if the search query length isless than or equal to a threshold number, then social-networking system160 may access one or more first verticals, but if the search querylength is greater than the threshold number, then social-networkingsystem 160 may access the first verticals and one or more secondverticals. This threshold number may be any suitable number ofcharacters, such as, for example, one, two, three, four, or fivecharacters. The first verticals and the second verticals may storeobjects of the same object-type or of different object-types. As anexample and not by way of limitation, if search query length is lessthan a threshold number, then social-networking system 160 may searchthe users verticals 164 to identify only 1^(st)-degree friends of thequerying user that substantially match the character string of thesearch query input. In other words, social-networking system 160 mayidentify one or more user nodes 202 within one degree of separation ofthe user node 202 of the querying user. But if the search query lengthis greater than the threshold number, then social-networking system 160may search the users verticals 164 to identify 1^(st)-degree or2^(nd)-degree friends of the querying user that substantially match thecharacter string of the search query input. In other words,social-networking system may identify one or more user nodes 202 withintwo degrees-of-separation of the user node 202 of the querying user. Inparticular embodiments, if the search query length is greater than botha first threshold number and a second threshold number, thensocial-networking system 160 may access the first verticals, the secondverticals, and one or more third verticals. The second threshold numbermust be at least one character greater in length than the firstthreshold number. In other words, there may be multiple thresholdnumbers delimiting access to particular verticals 164. As subsequentthreshold are crossed, social-networking system 160 may access one ormore additional verticals 164. Any suitable number of threshold numbersfor search query length may be specified. As an example and not by wayof limitation, social-networking system 160 may access a cacheassociated with a web browser or one or more verticals 164 of thesocial-networking system 160 in the following manner:

Threshold Search Number to Query Length Search Action Score 0-1 Searchcache for highest scoring cached All cached characters objects objects 2Search users vertical 164 for matches 100 characters among 1^(st)-degreeconnections 3 Search users vertical 164 for matches 150 characters among1^(st)-degree connections and 2^(nd)-degrees connections of the 10highest scoring 1^(st)-degree connections 4-5 Search users vertical 164for matches 200 characters among 1^(st)-degree and 2^(nd)-degreeconnections. Search pages vertical 164. 6-7 Search users vertical 164for matches 400 characters among 1^(st)-degree and 2^(nd)-degreeconnections, or matches among users in same employer or educationnetwork. Search pages vertical 164. Search locations vertical 164. 8 ormore Search entire social graph 200. 500 charactersIn this example, a first, second, third, fourth, and fifth thresholdnumber are specified at 1, 2, 3, 5, and 7 characters, respectively. Asthe search query length crosses each threshold, the scope of the searchis expanded. In other words, as the search query length increase to 2,3, 4, 6, and 8 characters, additional verticals 164 (or portions ofverticals 164) are added to the scope of the search. Although thisdisclosure describes accessing particular verticals 164 in a particularmanner, this disclosure contemplates accessing any suitable verticals164 in any suitable manner.

In particular embodiments, social-networking system 160 may access acache associated with a web browser 132 of a client system 130associated with the querying user. The cache may store information aboutone or more cached objects associated with the online social network. Ifthe search query length is less than a threshold number, thensocial-networking system 160 may access the cache to search for matchingobjects (via, for example, a client-side search process). Any suitableobjects (or portions of objects) associated with the online socialnetwork may be cached on the client system 130 of the querying user.Cached object (or information about such objects) may include, forexample, pages associated with nodes having a high social-graph affinitywith respect to the querying user (e.g., user-profile pages of closefriends or family), friends of the querying user, frequently accessedpages, recently accessed pages, other suitable objects, or anycombination thereof. As an example and not by way of limitation, asdescribed in the table above, when the search query length is less thanor equal to 1 character, social-networking system 160 may access a cacheassociated with a web browser 132 of the querying user to identifyobjects that substantially match the character string of the searchquery input. In this example, the cache may only store informationassociated with close friends and family of the querying user. However,as the search query length increases beyond this threshold,social-networking system 160 may search one or more verticals 164instead of (or possibly in addition to) the cache. In particularembodiments, social-networking system 160 may search the cache toidentify one or more cached objects that substantially match thecharacter string of the search query input. Cached objects may be searchand identified analogously to objects stored in verticals 164, asdescribed previously. In particular embodiments, social-networkingsystem 160 may send to the querying user one or more references to oneor more of the identified cached objects, respectively. Where theidentified object is stored in the cache of the client system 130 of thequerying user, social-networking system 160 may simply instruct the webbrowser 132 to retrieve the cached object from the cache. Alternatively,the identified cached object may be retrieved from the social-networkingsystem 160. Although this disclosure describes accessing particularcached objects in a particular manner, this disclosure contemplatesaccessing any suitable cached objects in any suitable manner.

In particular embodiments, social-networking system 160 may search eachaccessed verticals 164 to identify one or more objects thatsubstantially match the character string of the search query input.Social-networking system 160 may identify matching objects in anysuitable manner, such as, for example, by using one or more stringmatching algorithms to match the character string with a string ofcharacters associated with each of one or more of the objects. As anexample and not by way of limitation, in response to a search queryinput “kais”, as illustrated in FIG. 5B, social-networking system 160may access one or more users verticals 164 and one or more pagesverticals 164 and search the accessed verticals to identify objects(e.g., user-profile pages or concept-profile pages) stored in thoseverticals. Social-networking system 160 may submit the following querycommand to each accessed vertical:

(AND (name: “kais”)

-   -   (OR friends_of: (friends_of: <me>))    -   (OR pages: <>)).        Social-networking system 160 may access the index servers 330 of        each vertical 164, causing index server 330 to return results        that match the query command. As an example and not by way of        limitation, social-networking system 160 may access index server        330 of a users vertical 164, causing index server 330 to        identify users <Kaisen L>, <Nathen Kaiser>, <Catie Kaiser>, and        <Alex Kaiser> (each represented by an user identifier). That is,        users <Kaisen L>, <Nathen Kaiser>, <Catie Kaiser>, and <Alex        Kaiser> may have a name matching “kais.” Furthermore, each of        these identified users matches the query constraint (friends_of:        (friends_of: <me>)), which request objects corresponding to user        that are friend-of-friends of the querying user.        Social-networking system 160 may also access index server 330 of        a pages vertical 164, causing index server 330 to identify the        page for the band <Kaiser Chiefs>. That is, the band <Kaiser        Chiefs> has a name matching “kais.” Furthermore, the identify        page matches the query constraint (pages: <>), which request        objects corresponding to pages. As more characters are added to        the character string, the query command described above may be        modified to include additional query constraints that request        objects from additional verticals 164 (or additional portions of        the same verticals 164). In particular embodiments,        social-networking system 160 may aggregate the identified        objects by performing an OR operation on the identified objects.        Although this disclosure describes identifying particular        objects in a particular manner, this disclosure contemplates        identifying any suitable objects in any suitable manner. In        particular embodiments, social-networking system 160 may        generate a query command comprising a “weak and” (WAND) or        “strong or” operator (SOR). More information on WAND and SOR        operators may be found in U.S. patent application Ser. No.        13/560,901, filed 27 Jul. 2012, which is incorporated by        reference.

In particular embodiments, when searching verticals 164 to identifymatching objects, social-networking system 160 may only identify andscore up to a threshold number of matching nodes in a particularvertical 164. This threshold number of matching objects may then bescored and ranked by the social-networking system 160. The thresholdnumber may be chosen to enhance search quality or to optimize theprocessing of search results. As an example and not by way oflimitation, social-networking system 160 may only identify the top Nmatching objects (i.e., the number to score) in a users vertical 164 inresponse to a query command requesting users. The top N objects may bedetermined by a static ranking (e.g., ranking based on the currentsocial-graph affinity of the user with respect to the querying user) ofthe objects in a search index corresponding to the users vertical 164.In particular embodiments, the top N identified object may be re-rankedbased on the search query itself. As an example and not by way oflimitation, if the number to score is 500, the top 500 objects may beidentified. These 500 objects may then be ranked based on one or morefactors (e.g., match to the search query or other query constraints,social-graph affinity, search history, etc.), and the top M results maythen be generated as typeahead suggestions for display to the queryinguser (for example, the top 6 results may be displayed in a drop-downmenu 400, as illustrated in FIGS. 5A and 5B). In particular embodiments,the top results after one or more rounds of rankings may be sent to anaggregator 320 for a final round of ranking, where identified objectsmay be reordered, redundant results may be dropped, or any other type ofresults-processing may occur before presentation to the querying user.Although this disclosure describes identifying particular numbers ofobjects, this disclosure contemplates identifying any suitable numbersof objects. Furthermore, although this disclosure describes rankingobjects in a particular manner, this disclosure contemplates rankingobjects in any suitable manner.

In particular embodiments, social-networking system 160 may generate oneor more references to the identified objects. These references may begenerated as typeahead suggestions to be displayed to the user inresponse to the search query input from the querying user. The typeaheadsuggestions (e.g., the reference to the identified nodes or theircorresponding profile pages) may be scored (or ranked) and presented tothe user according to their relative degrees of relevance to the searchquery input, as determined by the particular search algorithm used togenerate the typeahead suggestions. The typeahead suggestions may alsobe scored and presented to the user according to their relative degreeof relevance to the user. In particular embodiments, the typeaheadsuggestions may be scored or ranked by a particular scoring/rankingalgorithm implemented by the search engine. As an example and not by wayof limitation, typeahead suggestions that are more relevant to thesearch query or to the user may be scored higher than the resources thatare less relevant. The way relevance is determined may be modified basedon the search intent identified by social-networking system 160. Inparticular embodiments, social-networking system 160 may rank the one ormore typeahead suggestions. Typeahead suggestions may be ranked, forexample, based on the score determined for the typeahead suggestion. Themost relevant result (e.g., highest/best scoring) may be ranked highest,with the remaining results having lower ranks commensurate with theirscore/relevance, such that the least relevant result is ranked lowest.Although this disclosure describes generating particular reference toidentified objects in a particular manner, this disclosure contemplatesgenerating any suitable references to identified object in any suitablemanner.

In particular embodiments, social-networking system 160 may send to thequerying user one or more references to one or more of the identifiedobjects, respectively. As the user enters the search query input as acharacter string into a query field 450, the typeahead processesdescribed previously may automatically send the references to theidentified objects as typeahead suggestions. The typeahead suggestionsmay be sent to the user, for example, in the form of a list of linksdisplayed in a drop-down menu 400 (which may be associated with thequery field 450), each link being associated with a different webpagecomprising the identified objects. In particular embodiments, each linkin the typeahead suggestions may comprise a Uniform Resource Locator(URL) that specifies where the corresponding webpage comprising thereferenced content object is located and the mechanism for retrievingit. Social-networking system 160 may then send the typeahead suggestionsto the web browser 132 on the user's client system 130. The user maythen click on the URL links or otherwise select the object from thedrop-down menu 400 to access the object from social-networking system160 or from an external system (such as, for example, third-party system170), as appropriate. In particular embodiments, each typeaheadsuggestion may include link to a profile page and a description orsummary of the profile page (or the node corresponding to that page).When generating the typeahead suggestions, social-networking system 160may generate one or more snippets for each typeahead suggestion, wherethe snippets are contextual information about the target of thetypeahead suggestion (i.e., contextual information about thesocial-graph entity, profile page, or other objects corresponding to theparticular typeahead suggestion). In particular embodiments,social-networking system 160 may only send typeahead suggestions havinga score/rank over a particular threshold score/rank. As an example andnot by way of limitation, social-networking system 160 may only send thetop ten suggestions back to the querying user in response to aparticular search query input. Although this disclosure describessending particular references to identified objects in a particularmanner, this disclosure contemplates sending any suitable references toidentified objects in any suitable manner.

FIG. 6 illustrates an example method 600 for searching verticals inresponse to a query. The method may begin at step 610, wheresocial-networking system 160 may receive from a first user of an onlinesocial network a search query comprising a character string having afirst number of characters. At step 620, social-networking system 160may access one or more verticals 164. Each vertical 164 may store one ormore objects associated with the online social network. If the firstnumber is less than or equal to a first threshold number, thensocial-networking system 160 may access one or more first verticals 164.However, if the first number is greater than the first threshold number,then social-networking system 160 may access the one or more firstverticals 164 and one or more second verticals 164. At step 630,social-networking system 160 may search each accessed vertical 164 toidentify one or more objects associated with the vertical 164 thatsubstantially match the character string. At step 640, social-networkingsystem 160 may send to the first user one or more references to one ormore of the identified objects, respectively. Particular embodiments mayrepeat one or more steps of the method of FIG. 6, where appropriate.Although this disclosure describes and illustrates particular steps ofthe method of FIG. 6 as occurring in a particular order, this disclosurecontemplates any suitable steps of the method of FIG. 6 occurring in anysuitable order. Moreover, although this disclosure describes andillustrates particular components, devices, or systems carrying outparticular steps of the method of FIG. 6, this disclosure contemplatesany suitable combination of any suitable components, devices, or systemscarrying out any suitable steps of the method of FIG. 6.

Systems and Methods

FIG. 7 illustrates an example computer system 700. In particularembodiments, one or more computer systems 700 perform one or more stepsof one or more methods described or illustrated herein. In particularembodiments, one or more computer systems 700 provide functionalitydescribed or illustrated herein. In particular embodiments, softwarerunning on one or more computer systems 700 performs one or more stepsof one or more methods described or illustrated herein or providesfunctionality described or illustrated herein. Particular embodimentsinclude one or more portions of one or more computer systems 700.Herein, reference to a computer system may encompass a computing device,and vice versa, where appropriate. Moreover, reference to a computersystem may encompass one or more computer systems, where appropriate.

This disclosure contemplates any suitable number of computer systems700. This disclosure contemplates computer system 700 taking anysuitable physical form. As example and not by way of limitation,computer system 700 may be an embedded computer system, a system-on-chip(SOC), a single-board computer system (SBC) (such as, for example, acomputer-on-module (COM) or system-on-module (SOM)), a desktop computersystem, a laptop or notebook computer system, an interactive kiosk, amainframe, a mesh of computer systems, a mobile telephone, a personaldigital assistant (PDA), a server, a tablet computer system, or acombination of two or more of these. Where appropriate, computer system700 may include one or more computer systems 700; be unitary ordistributed; span multiple locations; span multiple machines; spanmultiple data centers; or reside in a cloud, which may include one ormore cloud components in one or more networks. Where appropriate, one ormore computer systems 700 may perform without substantial spatial ortemporal limitation one or more steps of one or more methods describedor illustrated herein. As an example and not by way of limitation, oneor more computer systems 700 may perform in real time or in batch modeone or more steps of one or more methods described or illustratedherein. One or more computer systems 700 may perform at different timesor at different locations one or more steps of one or more methodsdescribed or illustrated herein, where appropriate.

In particular embodiments, computer system 700 includes a processor 702,memory 704, storage 706, an input/output (I/O) interface 708, acommunication interface 710, and a bus 712. Although this disclosuredescribes and illustrates a particular computer system having aparticular number of particular components in a particular arrangement,this disclosure contemplates any suitable computer system having anysuitable number of any suitable components in any suitable arrangement.

In particular embodiments, processor 702 includes hardware for executinginstructions, such as those making up a computer program. As an exampleand not by way of limitation, to execute instructions, processor 702 mayretrieve (or fetch) the instructions from an internal register, aninternal cache, memory 704, or storage 706; decode and execute them; andthen write one or more results to an internal register, an internalcache, memory 704, or storage 706. In particular embodiments, processor702 may include one or more internal caches for data, instructions, oraddresses. This disclosure contemplates processor 702 including anysuitable number of any suitable internal caches, where appropriate. Asan example and not by way of limitation, processor 702 may include oneor more instruction caches, one or more data caches, and one or moretranslation lookaside buffers (TLBs). Instructions in the instructioncaches may be copies of instructions in memory 704 or storage 706, andthe instruction caches may speed up retrieval of those instructions byprocessor 702. Data in the data caches may be copies of data in memory704 or storage 706 for instructions executing at processor 702 tooperate on; the results of previous instructions executed at processor702 for access by subsequent instructions executing at processor 702 orfor writing to memory 704 or storage 706; or other suitable data. Thedata caches may speed up read or write operations by processor 702. TheTLBs may speed up virtual-address translation for processor 702. Inparticular embodiments, processor 702 may include one or more internalregisters for data, instructions, or addresses. This disclosurecontemplates processor 702 including any suitable number of any suitableinternal registers, where appropriate. Where appropriate, processor 702may include one or more arithmetic logic units (ALUs); be a multi-coreprocessor; or include one or more processors 702. Although thisdisclosure describes and illustrates a particular processor, thisdisclosure contemplates any suitable processor.

In particular embodiments, memory 704 includes main memory for storinginstructions for processor 702 to execute or data for processor 702 tooperate on. As an example and not by way of limitation, computer system700 may load instructions from storage 706 or another source (such as,for example, another computer system 700) to memory 704. Processor 702may then load the instructions from memory 704 to an internal registeror internal cache. To execute the instructions, processor 702 mayretrieve the instructions from the internal register or internal cacheand decode them. During or after execution of the instructions,processor 702 may write one or more results (which may be intermediateor final results) to the internal register or internal cache. Processor702 may then write one or more of those results to memory 704. Inparticular embodiments, processor 702 executes only instructions in oneor more internal registers or internal caches or in memory 704 (asopposed to storage 706 or elsewhere) and operates only on data in one ormore internal registers or internal caches or in memory 704 (as opposedto storage 706 or elsewhere). One or more memory buses (which may eachinclude an address bus and a data bus) may couple processor 702 tomemory 704. Bus 712 may include one or more memory buses, as describedbelow. In particular embodiments, one or more memory management units(MMUs) reside between processor 702 and memory 704 and facilitateaccesses to memory 704 requested by processor 702. In particularembodiments, memory 704 includes random access memory (RAM). This RAMmay be volatile memory, where appropriate Where appropriate, this RAMmay be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, whereappropriate, this RAM may be single-ported or multi-ported RAM. Thisdisclosure contemplates any suitable RAM. Memory 704 may include one ormore memories 704, where appropriate. Although this disclosure describesand illustrates particular memory, this disclosure contemplates anysuitable memory.

In particular embodiments, storage 706 includes mass storage for data orinstructions. As an example and not by way of limitation, storage 706may include a hard disk drive (HDD), a floppy disk drive, flash memory,an optical disc, a magneto-optical disc, magnetic tape, or a UniversalSerial Bus (USB) drive or a combination of two or more of these. Storage706 may include removable or non-removable (or fixed) media, whereappropriate. Storage 706 may be internal or external to computer system700, where appropriate. In particular embodiments, storage 706 isnon-volatile, solid-state memory. In particular embodiments, storage 706includes read-only memory (ROM). Where appropriate, this ROM may bemask-programmed ROM, programmable ROM (PROM), erasable PROM (EPROM),electrically erasable PROM (EEPROM), electrically alterable ROM (EAROM),or flash memory or a combination of two or more of these. Thisdisclosure contemplates mass storage 706 taking any suitable physicalform. Storage 706 may include one or more storage control unitsfacilitating communication between processor 702 and storage 706, whereappropriate. Where appropriate, storage 706 may include one or morestorages 706. Although this disclosure describes and illustratesparticular storage, this disclosure contemplates any suitable storage.

In particular embodiments, I/O interface 708 includes hardware,software, or both, providing one or more interfaces for communicationbetween computer system 700 and one or more I/O devices. Computer system700 may include one or more of these I/O devices, where appropriate. Oneor more of these I/O devices may enable communication between a personand computer system 700. As an example and not by way of limitation, anI/O device may include a keyboard, keypad, microphone, monitor, mouse,printer, scanner, speaker, still camera, stylus, tablet, touch screen,trackball, video camera, another suitable I/O device or a combination oftwo or more of these. An I/O device may include one or more sensors.This disclosure contemplates any suitable I/O devices and any suitableI/O interfaces 708 for them. Where appropriate, I/O interface 708 mayinclude one or more device or software drivers enabling processor 702 todrive one or more of these I/O devices. I/O interface 708 may includeone or more I/O interfaces 708, where appropriate. Although thisdisclosure describes and illustrates a particular I/O interface, thisdisclosure contemplates any suitable I/O interface.

In particular embodiments, communication interface 710 includeshardware, software, or both providing one or more interfaces forcommunication (such as, for example, packet-based communication) betweencomputer system 700 and one or more other computer systems 700 or one ormore networks. As an example and not by way of limitation, communicationinterface 710 may include a network interface controller (NIC) ornetwork adapter for communicating with an Ethernet or other wire-basednetwork or a wireless NIC (WNIC) or wireless adapter for communicatingwith a wireless network, such as a WI-FI network. This disclosurecontemplates any suitable network and any suitable communicationinterface 710 for it. As an example and not by way of limitation,computer system 700 may communicate with an ad hoc network, a personalarea network (PAN), a local area network (LAN), a wide area network(WAN), a metropolitan area network (MAN), or one or more portions of theInternet or a combination of two or more of these. One or more portionsof one or more of these networks may be wired or wireless. As anexample, computer system 700 may communicate with a wireless PAN (WPAN)(such as, for example, a BLUETOOTH WPAN), a WI-FI network, a WI-MAXnetwork, a cellular telephone network (such as, for example, a GlobalSystem for Mobile Communications (GSM) network), or other suitablewireless network or a combination of two or more of these. Computersystem 700 may include any suitable communication interface 710 for anyof these networks, where appropriate. Communication interface 710 mayinclude one or more communication interfaces 710, where appropriate.Although this disclosure describes and illustrates a particularcommunication interface, this disclosure contemplates any suitablecommunication interface.

In particular embodiments, bus 712 includes hardware, software, or bothcoupling components of computer system 700 to each other. As an exampleand not by way of limitation, bus 712 may include an AcceleratedGraphics Port (AGP) or other graphics bus, an Enhanced Industry StandardArchitecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT)interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBANDinterconnect, a low-pin-count (LPC) bus, a memory bus, a Micro ChannelArchitecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, aPCI-Express (PCIe) bus, a serial advanced technology attachment (SATA)bus, a Video Electronics Standards Association local (VLB) bus, oranother suitable bus or a combination of two or more of these. Bus 712may include one or more buses 712, where appropriate. Although thisdisclosure describes and illustrates a particular bus, this disclosurecontemplates any suitable bus or interconnect.

Herein, a computer-readable non-transitory storage medium or media mayinclude one or more semiconductor-based or other integrated circuits(ICs) (such, as for example, field-programmable gate arrays (FPGAs) orapplication-specific ICs (ASICs)), hard disk drives (HDDs), hybrid harddrives (HHDs), optical discs, optical disc drives (ODDs),magneto-optical discs, magneto-optical drives, floppy diskettes, floppydisk drives (FDDs), magnetic tapes, solid-state drives (SSDs),RAM-drives, SECURE DIGITAL cards or drives, any other suitablecomputer-readable non-transitory storage media, or any suitablecombination of two or more of these, where appropriate. Acomputer-readable non-transitory storage medium may be volatile,non-volatile, or a combination of volatile and non-volatile, whereappropriate.

Miscellaneous

Herein, “or” is inclusive and not exclusive, unless expressly indicatedotherwise or indicated otherwise by context. Therefore, herein, “A or B”means “A, B, or both,” unless expressly indicated otherwise or indicatedotherwise by context. Moreover, “and” is both joint and several, unlessexpressly indicated otherwise or indicated otherwise by context.Therefore, herein, “A and B” means “A and B, jointly or severally,”unless expressly indicated otherwise or indicated otherwise by context.

The scope of this disclosure encompasses all changes, substitutions,variations, alterations, and modifications to the example embodimentsdescribed or illustrated herein that a person having ordinary skill inthe art would comprehend. The scope of this disclosure is not limited tothe example embodiments described or illustrated herein. Moreover,although this disclosure describes and illustrates respectiveembodiments herein as including particular components, elements,functions, operations, or steps, any of these embodiments may includeany combination or permutation of any of the components, elements,functions, operations, or steps described or illustrated anywhere hereinthat a person having ordinary skill in the art would comprehend.Furthermore, reference in the appended claims to an apparatus or systemor a component of an apparatus or system being adapted to, arranged to,capable of, configured to, enabled to, operable to, or operative toperform a particular function encompasses that apparatus, system,component, whether or not it or that particular function is activated,turned on, or unlocked, as long as that apparatus, system, or componentis so adapted, arranged, capable, configured, enabled, operable, oroperative.

What is claimed is:
 1. A method comprising, by one or more computingdevices: receiving, from a client system of a first user, a search queryinput comprising a character string having a first number of characters;searching, by the one or more computing devices, one or more indexes ofone or more verticals, respectively, to identify terms corresponding tothe search query input, each index comprising terms associated withobjects of a particular object-type of a plurality of object-typesindexed by the one or more verticals, wherein: if the first number isless than or equal to a first threshold number, then searching one ormore first indexes, wherein each first index is related to objects of afirst object-type; and if the first number is greater than the firstthreshold number, then searching the one or more first indexes and oneor more second indexes, wherein each second index is related to objectsof a second object-type different than the first object-type; andsending, to the client system of the first user, instructions forpresenting one or more suggested queries, each suggested querycomprising the character string of the search query input and one ormore of the identified terms.
 2. The method of claim 1, whereinsearching the one or more indexes of the one or more verticals furthercomprises: if the first number is greater than a second thresholdnumber, then searching the one or more first indexes, the one or moresecond indexes, and one or more third indexes, wherein each third indexis related to objects of a third object-type different than the firstobject-type and the second object-type, and wherein the second thresholdnumber is greater than the first threshold number.
 3. The method ofclaim 2, wherein: the first threshold number is one, two, three, four,or five characters; and the second threshold number is at least onecharacter greater than the first threshold number.
 4. The method ofclaim 2, wherein the first, second, and third object-types are eachselected from a group consisting of: a user; a photo; a post; a comment;a message; an event listing; a webpage; an application; a location; auser-profile page; a concept-profile page; a user group; an audio file;a video; an offer; or a coupon.
 5. The method of claim 1, wherein theone or more indexes are hosted by a plurality of index servers, whereineach index server is associated with one of the one or more verticals,and wherein each vertical stores objects of one of the plurality ofobject-types.
 6. The method of claim 1, wherein the search query inputis received from the first user through a query filed, and wherein thesuggested queries are displayed to the first user in a drop-down menuassociated with the query field while the first user inputs charactersinto the query field.
 7. The method of claim 6, wherein the suggestedqueries are ranked and a threshold number of top ranking suggestedqueries are displayed to the first user.
 8. The method of claim 7,wherein the suggested queries are ranked based on a plurality of factorscomprising: a social-graph affinity of users associated with one or morematching objects with respect to the first user; a first match to thesearch query input; a second match to one or more query constraints;first relative degrees of relevance to the search query input; secondrelative degrees of relevance to the first user; or a search history. 9.The method of claim 7, wherein the top ranking suggested queries areranked in one or more rounds of ranking.
 10. The method of claim 9,wherein the top ranking suggested queries are sent to an aggregator fora final round of ranking before being displayed to the first user. 11.The method of claim 6, wherein the query field is auto-populated withone of the suggested queries.
 12. The method of claim 6, wherein thequery field is on a web browser on the client system of the first user.13. The method of claim 6, wherein the suggested queries comprise one ormore elements associated with the identified terms for one or morematching objects, wherein the elements comprise one or more of: a namestring; a description; a metadata; a link to a webpage; a reference tothe matching objects; a Uniform Resource Locators (URLs) for thematching objects, or a mechanisms for retrieving the Uniform ResourceLocators (URLs).
 14. The method of claim 13, wherein the matchingobjects comprise one or more of: a profile page; a user node; a conceptnode; a social-graph element; an external webpage; or an object of theplurality of object-types.
 15. The method of claim 1, wherein the searchquery input is received by a client-side frontend typeahead process, andwherein the searching the one or more indexes of the one or morevertical is performed by a server-side backend typeahead process. 16.The method of claim 1, further comprising: receiving, from the clientsystem of the first user, an indication of a selection of one of thesuggested queries; searching the one or more verticals for one or morematching objects; and sending, to the client system of the first user,the one or more matching objects corresponding to the selection of thesuggested queries of the first user.
 17. The method of claim 1, furthercomprising: searching a social graph comprising a plurality of nodes anda plurality of edges connecting the nodes, each of the edges between twoof the nodes representing a single degree of separation, the nodescomprising: a first node corresponding to the first user; and aplurality of second nodes corresponding to a plurality of objectsassociated with an online social network, respectively.
 18. The methodof claim 1, wherein searching the one or more indexes of the one or moreverticals further comprises: if the first number is less than or equalto the first threshold number, then searching the one or more firstindexes associated with a social graph to identify one or more secondnodes within one degree of separation of a first node corresponding tothe first user; and if the first number is greater than the firstthreshold number, then searching the one or more first indexesassociated with the social graph to identify one or more second nodeswithin two degrees of separation of the first node corresponding to thefirst user.
 19. One or more computer-readable non-transitory storagemedia embodying software that is operable when executed to: receive,from a client system of a first user, a search query input comprising acharacter string having a first number of characters; search, by the oneor more computing devices, one or more indexes of one or more verticals,respectively, to identify terms corresponding to the search query input,each index comprising terms associated with objects of a particularobject-type of a plurality of object-types indexed by the one or moreverticals, wherein: if the first number is less than or equal to a firstthreshold number, then search one or more first indexes, wherein eachfirst index is related to objects of a first object-type; and if thefirst number is greater than the first threshold number, then search theone or more first indexes and one or more second indexes, wherein eachsecond index is related to objects of a second object-type differentthan the first object-type; and send, to the client system of the firstuser, instructions for presenting one or more suggested queries, eachsuggested query comprising the character string of the search queryinput and one or more of the identified terms.
 20. A system comprising:one or more processors; and a memory coupled to the processorscomprising instructions executable by the processors, the processorsoperable when executing the instructions to: receive, from a clientsystem of a first user, a search query input comprising a characterstring having a first number of characters; search, by the one or morecomputing devices, one or more indexes of one or more verticals,respectively, to identify terms corresponding to the search query input,each index comprising terms associated with objects of a particularobject-type of a plurality of object-types indexed by the one or moreverticals, wherein: if the first number is less than or equal to a firstthreshold number, then search one or more first indexes, wherein eachfirst index is related to objects of a first object-type; and if thefirst number is greater than the first threshold number, then search theone or more first indexes and one or more second indexes, wherein eachsecond index is related to objects of a second object-type differentthan the first object-type; and send, to the client system of the firstuser, instructions for presenting one or more suggested queries, eachsuggested query comprising the character string of the search queryinput and one or more of the identified terms.